Preserving Condorcet Winners under Strategic Manipulation
نویسندگان
چکیده
Condorcet extensions have long held a prominent place in social choice theory. A extension will return the winner as unique whenever such an alternative exists. However, definition of does not take into account possible manipulation by voters. profile where all agents vote truthfully may winner, but this end up set winners if are acting strategically. Focusing on class tournament solutions, we show that many natural functions class, well-known Copeland and Slater rules, cannot guarantee preservation when behave Our main result respect is impossibility theorem establishes no solution satisfying very weak decisiveness requirement can provide guarantee. On bright side, identify several indecisive otherwise attractive solutions do under strategic for large preference extensions.
منابع مشابه
Condorcet Winners for Public Goods
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner if there is no other location in the network where more than half of the voters would have been closer to than the majority rule winner. We develop fast algorithms for interesting cases with nice combinatorial struct...
متن کاملCondorcet winners on median spaces
We characterize the outcome of majority voting for single–peaked preferences on median spaces. This large class of preferences covers a variety of multi–dimensional policy spaces including products of lines (e.g. grids), trees, and hypercubes. Our main result is the following: If a Condorcet winner (i.e. a winner in pairwise majority voting) exists, then it coincides with the appropriately defi...
متن کاملWhen Voters Strategize, Approval Voting Elects Condorcet Winners but Condorcet Methods can Elect Condorcet Losers
We show that approval voting strategic equilibria are closely related to honest Condorcet Winners. There exists an approval equilibrium with a clear font-runner F and runner-up R if and only if the F is the clear Condorcet Winner and R the Condorcet runner-up. In contrast, we show that margins-based Condorcet methods can elect a Condorcet Loser with non-zero probibility when voters vote tactica...
متن کاملDueling Bandits: Beyond Condorcet Winners to General Tournament Solutions
Recent work on deriving O(log T ) anytime regret bounds for stochastic dueling bandit problems has considered mostly Condorcet winners, which do not always exist, and more recently, winners defined by the Copeland set, which do always exist. In this work, we consider a broad notion of winners defined by tournament solutions in social choice theory, which include the Copeland set as a special ca...
متن کاملRestricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency
In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made computationally difficult for the agents to perform. However, there are scenarios in which a restricted form of manipulation can instead be beneficial. In this paper we c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i6.16657